A Global Method for Reducing Multidimensional Size Graphs
نویسندگان
چکیده
This paper introduces the concept of discrete multidimensional size function, a mathematical tool studying the so-called size graphs. These graphs constitute an ingredient of Size Theory, a geometrical/topological approach to shape analysis and comparison. A global method for reducing size graphs is presented, together with a theorem stating that size graphs reduced in such a way preserve all the information in terms of multidimensional size functions. This approach can lead to simplify the effective computation of discrete multidimensional size functions.
منابع مشابه
ar X iv : 1 40 1 . 80 96 v 2 [ co nd - m at . d is - n n ] 1 8 M ay 2 01 4 Shortest node - disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملShortest node-disjoint paths on random graphs
A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...
متن کاملOn global (strong) defensive alliances in some product graphs
A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...
متن کاملHyperplane Separation Technique for Multidimensional Mean-Payoff Games
Two-player games on graphs are central in many problems in formal verification and program analysis such as synthesis and verification of open systems. In this work, we consider both finite-state game graphs, and recursive game graphs (or pushdown game graphs) that can model the control flow of sequential programs with recursion. The objectives we study are multidimensional mean-payoff objectiv...
متن کاملVisualizing gene interaction graphs with local multidimensional scaling
Several bioinformatics data sets are naturally represented as graphs, for instance gene regulation, metabolic pathways, and proteinprotein interactions. The graphs are often large and complex, and their straightforward visualizations are incomprehensible. We have recently developed a new method called local multidimensional scaling for visualizing high-dimensional data sets. In this paper we ad...
متن کامل